Evaluation of Temporal Formulas Based on "Checking by Spheres"
نویسنده
چکیده
Classical algorithms of evaluation of temporal CTL formulas are constructed “bottom-up”. A formula must be evaluated completely to give the result. In the paper, a new concept of “top-down” evaluation of temporal QsCTL (CTL with state quantifiers) formulas, called “Checking By Spheres” is presented. The new algorithm has two general advantages: the evaluation may be stopped on certain conditions in early steps of the algorithm (not the whole formula and not whole state space should be analyzed), and state quantification may be used in formulas (even if a range of a quantifier is not statically obtainable).
منابع مشابه
Past-directed Evaluation of Dynamic Integrity Constraints in Temporal Databases
This work can be considered a step to simplify the dynamic integrity constraint checking. We propose a method to transform a dynamic constraint to an equivalent past-directed form. This transformation will facilitate the constraint checking in temporal databases. The method proposed deals with integrity constraints defined by first-order logic formulas with explicit time in a denial form. It is...
متن کاملBounded Model Checking of Temporal Formulas with Alloy
Alloy is a formal modeling language based on first-order relational logic, with no native support for specifying reactive systems. We propose an extension of Alloy to allow the specification of temporal formulas using LTL, and show how they can be verified by bounded model checking with the Alloy Analyzer.
متن کاملDesign and Verification of an Agent-Based System
The paper describes design and verification problems of agent-based systems. An agent-based system for support decision making for physicians is proposed. Knowledge base is represented by a propositional logic formulas and we use deductive reasoning. Model of the system is given in Statecharts visual language. Required properties of the system can be given as formulas of the branching-time temp...
متن کاملModel Checking Temporal Logic Formulas Using Sticker Automata
As an important complex problem, the temporal logic model checking problem is still far from being fully resolved under the circumstance of DNA computing, especially Computation Tree Logic (CTL), Interval Temporal Logic (ITL), and Projection Temporal Logic (PTL), because there is still a lack of approaches for DNA model checking. To address this challenge, a model checking method is proposed fo...
متن کاملIdentifying meaningless parameterized linear - temporal - logic formulas
Parameterized runtime monitoring formalisms allow predicates to bind free variables to values during the program’s execution. Some runtime monitoring tools, like J-LO , increase the formalism’s expressiveness by allowing predicates to query variables already during the matching process. This is problematic because, if no special care is taken, the predicate’s evaluation may need to query a vari...
متن کامل